Null-Space Preconditioners for Saddle Point Systems
نویسندگان
چکیده
منابع مشابه
Null-Space Preconditioners for Saddle Point Systems
We will present theory that underpins the use of null-space preconditioners, giving eigenvalue bounds that show that the eigenvalues of the preconditioned system are clustered when a good approximation to the null-space matrix can be found. Additionally, we will describe how two of the family of preconditioners, although indefinite and non-symmetric, can be applied with a Krylov method with a s...
متن کاملPreconditioners for Generalized Saddle-point Problems Preconditioners for Generalized Saddle-point Problems *
We examine block-diagonal preconditioners and efficient variants of indefinite preconditioners for block two-by-two generalized saddle-point problems. We consider the general, nonsymmetric, nonsingular case. In particular, the (1,2) block need not equal the transposed (2,1) block. Our preconditioners arise from computationally efficient splittings of the (1,1) block. We provide analyses for the...
متن کاملH-matrix preconditioners for saddle-point systems from meshfree discretization∗
In this paper we describe and compare preconditioners for saddle-point systems obtained from meshfree discretizations, using the concepts of hierarchical (or H-)matrices. Previous work by the authors using this approach did not use H-matrix techniques throughout, as is done here. Comparison shows the method described here to be better than the author’s previous method, an AMG method adapted to ...
متن کاملOn Signed Incomplete Cholesky Factorization Preconditioners for Saddle-Point Systems
Limited-memory incomplete Cholesky factorizations can provide robust preconditioners for sparse symmetric positive-definite linear systems. In this paper, the focus is on extending the approach to sparse symmetric indefinite systems in saddle-point form. A limited-memory signed incomplete Cholesky factorization of the form LDL is proposed, where the diagonal matrix D has entries ±1. The main ad...
متن کاملAnalysis of Preconditioners for Saddle-Point Problems
Analysis of pre onditioners for saddle-point problems D. Loghin and A. J. Wathen Mixed nite element formulations give rise to large, sparse, blo k linear systems of equations the solution of whi h is often sought via a pre onditioned iterative te hnique. In this work we present a general analysis of blo kpre onditioners based on the stability onditions inherited from the formulation of the nite...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Matrix Analysis and Applications
سال: 2016
ISSN: 0895-4798,1095-7162
DOI: 10.1137/15m1021349